Construction Techniques of Generator Polynomials of BCH Codes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction and decoding of BCH Codes

BCfi wdes over arbitrary finite ~~~nirnut:!tiv~ rings with identity arc drip& in LCF~S of their locator vector, The derivation is hased on the factorization of .I-’ -I over the unit ring of an ~tppropr~lt~ extension of the finite rin g. We prcscnt an ~~~ci~nt,d~~iu~ procedure, based on the modified Berlekamp Massey ;li~~~rithrn. for that codes. The code construction and the decoding proccdurcs ...

متن کامل

Construction of digital nets from BCH-codes

We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental problem of net embeddings of linear codes. Our main result is the construction of four infinite families of digital (t, m, s)-nets based on BCH-codes.

متن کامل

Deterministic Construction of Compressed Sensing Matrices using BCH Codes

In this paper we introduce deterministic m×n RIP fulfilling ±1 matrices of order k such that log m log k ≈ log(log2 n) log(log2 k) . The columns of these matrices are binary BCH code vectors that their zeros are replaced with −1 (excluding the normalization factor). The samples obtained by these matrices can be easily converted to the original sparse signal; more precisely, for the noiseless sa...

متن کامل

Generator polynomials and generator matrix for quasi cyclic codes

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length sl with index s over the finite field F are F[y]-submodules of the ring F[x, y]/< x − 1, y − 1 >. The aim of the present paper, is to study QC codes of length sl with index s over the finite field F and find generator polynomials and generator matrix for these codes. To achieve this...

متن کامل

Convolutional Codes: Techniques of Construction

In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying these methods, several new families of convolutional codes can be constructed. As an example of code expansion, families of convolutional codes derived from clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Journal of Applied Science & Technology

سال: 2014

ISSN: 2231-0843

DOI: 10.9734/bjast/2014/6089